CONSTRUCTION OF TABLEAUX FOR CLASSICAL LOGIC: Tableaux as Combinations of Branches, Branches as Chains of Sets
نویسنده
چکیده
The paper is devoted to an approach to analytic tableaux for propositional logic, but can be successfully extended to other logics. The distinguishing features of the presented approach are: (i) a precise set-theoretical description of tableau method; (ii) a notion of tableau consequence relation is defined without help of a notion of tableau, in our universe of discourse the basic notion is a branch; (iii) we define a tableau as a finite set of some chosen branches which is enough to check; hence, in our approach a tableau is only a way of choosing a minimal set of closed branches; (iv) a choice of tableau can be arbitrary, it means that if one tableau starting with some set of premisses is closed in the defined sense, then every branch in the power set of the set of formulas, that starts with the same set, is closed.
منابع مشابه
Tableaux + Constraints
There is an increasing number of publications in which the analytic tableaux calculus is combined with technology based on constraint solving. Although the details, as well as the purpose of these combinations vary widely, the results are invariably referred to as “constraint tableaux” or sometimes “constrained tableaux”. We review some of the combinations and propose a more differentiated nome...
متن کاملGoal - Directed Tableaux ∗
This paper contains a new format for analytic tableaux, called goaldirected tableaux. Their main interest lies in the fact that they are more efficient than the usual analytic tableaux (in general, they lead to less branching). They can also be used to develop an efficient tableaux-based approach to abduction. The goal-directed tableaux do not form a full decision method for propositional class...
متن کاملEmpirical Investigation on Combining Tableaux and Resolution
There are several attempts to automate tableau calculi in first-order classical logic. The combining of tableaux and resolution is one of the directions of such investigations. In some published papers of ours, we proposed a general splitting technique on resolution derivations, by applying tableaux to represent distinct branches of derivations. In order to make tableaux sufficient for such a r...
متن کاملIntroducing general redundancy criteria for clausal tableaux, and proposing resolution tableaux
Hyper tableau calculi are well-known as attempts to combine hyper-resolution and tableaux. Besides their soundness and completeness, it is also important to give an appropriate redundancy criterion. The task of such a criterion is to filter out “unnecessary” clauses being attached to a given tableau. This is why we investigate what redundancy criteria can be defined for clausal tableaux, in gen...
متن کاملTheorem Proving and Model Building with the Calculus KE
A Prolog implementation of a new theorem-prover for rst-order classical logic is described. The prover is based on the calculus KE and the rules used for analysing quantiiers in free variable semantic tableaux. A formal speciication of the rules used in the implementation is described, for which soundness and completeness is straightforwardly veriied. The prover has been tested on the rst 47 pr...
متن کامل